DAP Prolog: A Set-oriented Approach to Prolog

Integrating an Answer Set Solver into Prolog: ASP-PROLOG

A number of answer set solvers have been proposed in recent years, such as Smodels, DLV, Cmodels, and ASSAT. Most existing ASP solvers have been extended to provide front-ends that are suitable to encode specialized forms of knowledge—e.g., weight-constraints, restricted forms of optimization, front-ends for planning and diagnosis. These features allow declarative solutions in specific applicat...

A logical approach to A-Prolog

It has been recently provided a characterization of Answer Sets by intuitionistic logic as follows: a literal is entailed by a program in the stable model semantics if and only if it belongs to every intuitionistically complete and consistent extension of the program formed by adding only negated literals. We show that if we replace intuitionistic logic by any si-logic the result still holds.

GNU Prolog: Beyond Compiling Prolog to C

We describe in this paper the compilation scheme of the GNU Prolog system. This system is built on our previous experience of compiling Prolog to C in wamcc. The compilation scheme has been however redesigned to overcome drawbacks of the compilation to C. In particular, GNU-Prolog is based on a low-level miniassembly platform-independent language that makes it possible to avoid the phase of com...

GNU Prolog: beyond ompiling Prolog to C

Prolog(elex): a New Tool to Generate Prolog Tokenizers

This paper presents a tool called Elex(Prolog) to construct tokenizers (lexical analysers, scanners , lexers) in Prolog. It is based on Elex, a multilingual scanner generator by Matthew Phillips. The paper motivates the tool, and presents its functionality and implementation. It also compares Elex(Prolog) to the only alternative Prolog scanner generator that we are aware of: plex. 1 Motivation ...